A 1.376 Approximation Algorithm for the Steiner Tree Problem
نویسنده
چکیده
The Steiner tree problem is one of the classic and most fundamental NP-hard problems: given an arbitrary weighted graph, seek a minimum-cost tree spanning a given subset of the vertices (terminals). This article presents a two-phase heuristic in greedy strategy that achieves an approximation ratio of ≈ 1.430 for general graphs. Through combining the two-phase heuristic and the LP-based approximation algorithm due to Byrka et al. [Journal of the ACM, vol. 60, no. 1, pp. 6:1–6:33, Feb. 2013], this article presents an enhanced two-phase heuristic that achieves a best-known approximation ratio of ≈ 1.376 for general graphs.
منابع مشابه
On approximation algorithms for the terminal Steiner tree problem
The terminal Steiner tree problem is a special version of the Steiner tree problem, where a Steiner minimum tree has to be found in which all terminals are leaves. We prove that no polynomial time approximation algorithm for the terminal Steiner tree problem can achieve an approximation ratio less than (1− o(1)) lnn unless NP has slightly superpolynomial time algorithms. Moreover, we present a ...
متن کامل(1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
Selected-internal Steiner minimum tree problem is a generalization of original Steiner minimum tree problem. Given a weighted complete graph G = (V,E) with weight function c, and two subsets R ′ ( R ⊆ V with |R − R ′ | ≥ 2, selected-internal Steiner minimum tree problem is to find a Steiner minimum tree T of G spanning R such that any leaf of T does not belong to R ′ . In this paper, suppose c ...
متن کاملA simple approximation algorithm for the internal Steiner minimum tree
For a metric graph G = (V,E) and R ⊂ V , the internal Steiner minimum tree problem asks for a minimum weight Steiner tree spanning R such that every vertex in R is not a leaf. This note shows a simple polynomial-time 2ρapproximation algorithm, in which ρ is the approximation ratio for the Steiner minimum tree problem. The result improves the approximation ratio 2ρ+ 1 in [3].
متن کاملOn the hardness of full Steiner tree problems
Given a weighted graph G = (V,E) and a subset R of V , a Steiner tree in G is a tree which spans all vertices in R. The vertices in V \R are called Steiner vertices. A full Steiner tree is a Steiner tree in which each vertex of R is a leaf. The full Steiner tree problem is to find a full Steiner tree with minimum weight. The bottleneck full Steiner tree problem is to find a full Steiner tree wh...
متن کاملFast Approximation Algorithm for Restricted Euclidean Bottleneck Steiner Tree Problem
Bottleneck Steiner tree problem asks to find a Steiner tree for n terminals with at most k Steiner points such that the length of the longest edge in the tree is minimized. The problem has applications in the design of wireless communication networks. In this paper we study a restricted version of the bottleneck Steiner tree problem in the Euclidean plane which requires that only degree-2 Stein...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017